# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def divideString(self, s: str, k: int, fill: str) -> List[str]:
        ans = []

        for i in range(len(s) // k):
            ans.append(s[i * k: i * k + k])

        remain = len(s) % k
        if remain > 0:
            remain_str = s[len(s) - remain:]
            remain_str = remain_str+ "".join(fill * (k - remain))
            ans.append(remain_str)
        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ("abcdefghi", 3, "x", ["abc","def","ghi"]),
        ("abcdefghij", 3, "x", ["abc","def","ghi","jxx"])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果

        input1 = case_item[0]
        input2 = case_item[1]
        input3 = case_item[2]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.divideString(input1, input2, input3)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

